Approximation of Convex Figures by Pairs of Rectangles
نویسندگان
چکیده
We consider the problem of approximating a convex gure in the plane by a pair r R of homothetic that is similar and parallel rectangles with r C R We show the existence of such a pair where the sides of the outer rectangle are at most twice as long as the sides of the inner rectangle thereby solving a problem posed by P olya and Szeg o If the n vertices of a convex polygon C are given as a sorted array such an approximating pair of rectangles can be computed in time O log n
منابع مشابه
SIZE AND GEOMETRY OPTIMIZATION OF TRUSS STRUCTURES USING THE COMBINATION OF DNA COMPUTING ALGORITHM AND GENERALIZED CONVEX APPROXIMATION METHOD
In recent years, the optimization of truss structures has been considered due to their several applications and their simple structure and rapid analysis. DNA computing algorithm is a non-gradient-based method derived from numerical modeling of DNA-based computing performance by new computers with DNA memory known as molecular computers. DNA computing algorithm works based on collective intelli...
متن کاملComputationally-Feasible Truthful Auctions for Convex Bundles
In many economic settings, like spectrum and real-estate auctions, geometric figures on the plane are for sale. Each bidder bids for his desired figure, and the auctioneer has to choose a set of disjoint figures that maximizes the social welfare. In this work, we design mechanisms that are both incentive compatible and computationally feasible for these environments. Since the underlying algori...
متن کاملApproximating Minimum-Area Rectangular and Convex Containers for Packing Convex Polygons
We investigate the problem of finding a minimum-area container for the disjoint packing of a set of convex polygons by translations. In particular, we consider axis-parallel rectangles or arbitrary convex sets as containers. For both optimization problems which are NP-hard we develop efficient constant factor approximation algorithms.
متن کاملA HYBRID ALGORITHM FOR SIZING AND LAYOUT OPTIMIZATION OF TRUSS STRUCTURES COMBINING DISCRETE PSO AND CONVEX APPROXIMATION
An efficient method for size and layout optimization of the truss structures is presented in this paper. In order to this, an efficient method by combining an improved discrete particle swarm optimization (IDPSO) and method of moving asymptotes (MMA) is proposed. In the hybrid of IDPSO and MMA, the nodal coordinates defining the layout of the structure are optimized with MMA, and afterwards the...
متن کاملConstruction heuristics for two-dimensional irregular shape bin packing with guillotine constraints
The paper examines a new problem in the irregular packing literature that has existed in industry for decades; two-dimensional irregular (convex) bin packing with guillotine constraints. Due to the cutting process of certain materials, cuts are restricted to extend from one edge of the stock-sheet to another, called guillotine cutting. This constraint is common place in glass cutting and is an ...
متن کامل